Finiteness theorems for potentially equivalent Galois representations: Extension of Faltings’ finiteness criteria

نویسندگان

چکیده

We study the relationship between potential equivalence and character theory; we observe that of a representation ρ \rho is determined by an equality alttext="m"> m encoding="application/x-tex">m -power alttext="g right-arrow from bar upper T r left-parenthesis rho g Superscript m Baseline right-parenthesis right-parenthesis"> g ↦ T r stretchy="false">( stretchy="false">) encoding="application/x-tex">g\mapsto Tr(\rho (g^m)) for some natural number . Using this, extend Faltings’ finiteness criteria to determine two alttext="script l"> ℓ<!-- ℓ encoding="application/x-tex">\ell -adic, semisimple representations absolute Galois group field, context equivalence. also discuss results twist unramified representations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finiteness Theorems for Submersions and Souls

The first section of this paper provides an improvement upon known finiteness theorems for Riemannian submersions; that is, theorems which conclude that there are only finitely many isomorphism types of fiber bundles among Riemannian submersions whose total spaces and base spaces both satisfy certain geometric bounds. The second section of this paper provides a sharpening of some recent theorem...

متن کامل

Some Finiteness Theorems for Abelian Varieties

Last time we saw (see Proposition 6.5 in those lecture notes) that an abelian variety A of dimension g over K, the fraction field of a henselian dvr R, acquires semistable reduction over K(A[`]) for ` equal to 4 or an odd prime, with ` not divisible by the residue characteristic. (The same circle of ideas yielded the non-obvious fact that over K the intersection of two “semistable field extensi...

متن کامل

Finiteness Theorems in Stochastic Integer Programming

We study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finitely many “building blocks”, independent of the number of scenarios, and we give an effective procedure to compute them. The paper includes an introduction to Nash-Williams’ theory of better-quasi-orderings, which is u...

متن کامل

Finiteness theorems for the Picard objects of an algebraic stack

We prove some finiteness theorems for the Picard functor of an algebraic stack, in the spirit of SGA6, exp. XII and XIII. In particular, we give a stacky version of Raynaud’s relative representability theorem, we give sufficient conditions for the existence of the torsion component of the Picard functor, and for the finite generation of the Néron-Severi groups or of the Picard group itself. We ...

متن کامل

Finiteness theorems for algebraic groups over function fields

We prove the finiteness of class numbers and Tate-Shafarevich sets for all affine group schemes of finite type over global function fields, as well as the finiteness of Tamagawa numbers and Godement’s compactness criterion (and a local analogue) for all such groups that are smooth and connected. This builds on the known cases of solvable and semisimple groups via systematic use of the recently ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2023

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/15856